A lower bound for the r-order of a matrix modulo N
نویسندگان
چکیده
منابع مشابه
the effect of consciousness raising (c-r) on the reduction of translational errors: a case study
در دوره های آموزش ترجمه استادان بیشتر سعی دارند دانشجویان را با انواع متون آشنا سازند، درحالی که کمتر به خطاهای مکرر آنان در متن ترجمه شده می پردازند. اهمیت تحقیق حاضر مبنی بر ارتکاب مکرر خطاهای ترجمانی حتی بعد از گذراندن دوره های تخصصی ترجمه از سوی دانشجویان است. هدف از آن تاکید بر خطاهای رایج میان دانشجویان مترجمی و کاهش این خطاها با افزایش آگاهی و هوشیاری دانشجویان از بروز آنها است.از آنجا ک...
15 صفحه اولinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
A Matrix Lower Bound
A matrix lower bound is defined that generalizes ideas apparently due to S. Banach and J. von Neumann. The matrix lower bound has a natural interpretation in functional analysis, and it satisfies many of the properties that von Neumann stated for it in a restricted case. Applications for the matrix lower bound are demonstrated in several areas. In linear algebra, the matrix lower bound of a ful...
متن کاملA (5/2)n2-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication
We prove a lower bound of 5 2 n 2 ? 3n for the multiplicative complexity of n n{matrix multiplication over arbitrary elds. More general, we show that for any nite dimensional semisimple algebra A with unity, the multiplicative complexity of the multiplication in A is bounded from below by 5 2 dim A ? 3(n1 + + nt) if the decomposition of A = A1 At into simple algebras A = D n n contains only non...
متن کاملA Lower Bound for Matrix Multiplication
We prove that computing the product of two 11 X 11 matrices over the binary field requires at least 2.5 11:1 0 (11:1) multiplications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monatshefte für Mathematik
سال: 2007
ISSN: 0026-9255,1436-5081
DOI: 10.1007/s00605-007-0484-2